A constant-time dynamic storage allocator for real-time systems
نویسندگان
چکیده
منابع مشابه
Implementation of a constant-time dynamic storage allocator
This paper describes the design criteria and implementation details of a dynamic storage allocator for real-time systems. The main requirements that have to be considered when designing a new allocator are concerned with temporal and spatial constraints. The proposed algorithm, called TLSF (two-level segregated fit), has an asymptotic constant cost, O(1), maintaining a fast response time (less ...
متن کاملA real-time recursive dynamic model for vehicle driving simulators
This paper presents the Real-Time Recursive Dynamics (RTRD) model that is developed for driving simulators. The model could be implemented in the Driving Simulator. The RTRD can also be used for off-line high-speed dynamics analysis, compared with commercial multibody dynamics codes, to speed up mechanical design process. An overview of RTRD is presented in the paper. Basic models for specific ...
متن کاملDynamic storage allocation for real - time embedded systems ∗
Dynamic memory allocation DSA algorithms have played in important role in the modern software engineering paradigms and techniques (as object oriented paradigm). Additionally, its utilization allows to increase the flexibility and functionalities of the applications. There exists in the literature a large number of works and references to this particular issue. However, in the real-time communi...
متن کامل- - - - Constant - time pattern matching for real - time production systems Dale
__________ Many intelligent systems must respond to sensory data or critical environmental conditions in fixed, predictable time. Rule-based systems, including those based on the efficient Rete matching algorithm, cannot guarantee this result. Improvement in execution-time efficiency is not all that is needed here; it is important to ensure constant, O(1) time limits for portions of the matchin...
متن کاملStorage Allocation for Real-Time, Embedded Systems
Dynamic storage allocation and automatic garbage collection are among the most popular features that high-level languages can o er. However, time-critical applications cannot be written in such languages unless the time taken to allocate and deallocate storage can be reasonably bounded. In this paper, we present algorithms for automatic storage allocation that are appropriate for real-time and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Real-Time Systems
سال: 2008
ISSN: 0922-6443,1573-1383
DOI: 10.1007/s11241-008-9052-7